Countable connected-homogeneous graphs
نویسندگان
چکیده
A graph is connected-homogeneous if any isomorphism between finite connected induced subgraphs extends to an automorphism of the graph. In this paper we classify the countably infinite connectedhomogeneous graphs. We prove that if Γ is connected countably infinite and connected-homogeneous then Γ is isomorphic to one of: Lachlan and Woodrow’s ultrahomogeneous graphs; the generic bipartite graph; the bipartite ‘complement of a complete matching’; the line graph of the complete bipartite graph Kא0,א0 ; or one of the ‘treelike’ distancetransitive graphs Xκ1,κ2 where κ1, κ2 ∈ N∪{א0}. It then follows that an arbitrary countably infinite connected-homogeneous graph is a disjoint union of a finite or countable number of disjoint copies of one of these graphs, or to the disjoint union of countably many copies of a finite connected-homogeneous graph. The latter were classified by Gardiner (1976). We also classify the countably infinite connected-homogeneous posets.
منابع مشابه
On Countable Dense and n-homogeneity
We prove that a connected, countable dense homogeneous space is n-homogeneous for every n, and strongly 2-homogeneous provided it is locally connected. We also present an example of a connected and countable dense homogeneous space which is not strongly 2-homogeneous. This answers in the negative Problem 136 of Watson in the Open Problems in Topology Book.
متن کاملCountable homogeneous multipartite graphs
We give a classification of all the countable homogeneous multipartite graphs. This generalizes the similar result for bipartite graphs given in [5]. 2010 Mathematics Subject Classification 05C99 keywords: multipartite graph, homogeneous, classification
متن کاملCycle-types in the automorphism groups of countable homogeneous graphs
We give a classification of all the cycle types occurring in the automorphism groups of countable homogeneous graphs.
متن کاملA Universal Structure for Jv-free Graphs
Countable homogeneous graphs have been classified by Alistair Lachlan and Robert Woodrow [5,11]. There is a countable bipartite graph called the universal 'homogeneous' bipartite graph. However, this graph does not occur in Lachlan and Woodrow's list, because it is not homogeneous as a graph but only as a graph with a fixed bipartition (Cameron [1]). In this paper, I describe a graph which is a...
متن کاملInvariant measures on the set of graphs and homogeneous uncountable universal graphs
We describe the set of all invariant measures on the spaces of universal countable graphs and on the spaces of universal countable triangles-free graphs. The construction uses the description of the S∞-invariant measure on the space of infinite matrices in terms of measurable function of two variables on some special space. In its turn that space is nothing more than the universal continuous (B...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 100 شماره
صفحات -
تاریخ انتشار 2010